Visualizations for Assessing Convergence and Mixing of MCMC
نویسندگان
چکیده
Bayesian inference often requires approximating the posterior distribution with Markov Chain Monte Carlo (MCMC) sampling. A central problem with MCMC is how to detect whether the simulation has converged. The samples come from the true posterior distribution only after convergence. A common solution is to start several simulations from different starting points, and measure overlap of the different chains. We point out that Linear Discriminant Analysis (LDA) minimizes the overlap measured by the usual multivariate overlap measure. Hence, LDA is a justified method for visualizing convergence. However, LDA makes restrictive assumptions about the distributions of the chains and their relationships. These restrictions can be relaxed by a recently introduced extension.
منابع مشابه
Comparisons of Markov Chain Monte Carlo Convergence Diagnostic Tests for Bayesian Logistic Random Effect Models
In mixed models, posterior densities are too difficult to work with directly. With the Markov chain Monte Carlo (MCMC) methods, to do statistical inference requires the convergence of the MCMC chain to its stationary distribution. To assess convergence of Markov chain has not a specific way. Assessing convergence of Markov chain has been developed many techniques. Although increasingly populari...
متن کاملAnalysis of Convergence Rates of Some Gibbs Samplers on Continuous State Spaces
The problem of sampling from a given distribution on high-dimensional continuous spaces arises in the computational sciences and Bayesian statistics, and a frequentlyused solution is Markov chain Monte Carlo (MCMC); see [13] for many examples. Because MCMC methods produce good samples only after a lengthy mixing period, a long-standing mathematical question is to analyze the mixing times of the...
متن کاملLower Bounds on the Convergence Rates of Adaptive Mcmc Methods
We consider the convergence properties of recently proposed adaptive Markov chain Monte Carlo (MCMC) algorithms for approximation of high-dimensional integrals arising in Bayesian analysis and statistical mechanics. Despite their name, in the general case these algorithms produce non-Markovian, time-inhomogeneous, irreversible stochastic processes. Nevertheless, we show that lower bounds on the...
متن کاملAWTY (are we there yet?): a system for graphical exploration of MCMC convergence in Bayesian phylogenetics
UNLABELLED A key element to a successful Markov chain Monte Carlo (MCMC) inference is the programming and run performance of the Markov chain. However, the explicit use of quality assessments of the MCMC simulations-convergence diagnostics-in phylogenetics is still uncommon. Here, we present a simple tool that uses the output from MCMC simulations and visualizes a number of properties of primar...
متن کامل